Declarative Compilation for Constraint Logic Programming
نویسندگان
چکیده
We present a new declarative compilation of logic programs with constraints into variable-free relational theories which are then executed by rewriting. This translation provides an algebraic formulation of the abstract syntax of logic programs. Management of logic variables, unification, and renaming apart is completely elided in favor of algebraic manipulation of variable-free relation expressions. We prove the translation is sound, and the rewriting system complete with respect to traditional SLD semantics.
منابع مشابه
Constraint Logic Programming with a Relational Machine 1 Emilio
We present a declarative framework for the compilation of constraint logic programs into variablefree relational theories which are then executed by rewriting. This translation provides an algebraic formulation of the abstract syntax of logic programs. Logic variables, unification, and renaming apart are completely elided in favor of manipulation of variable-free relation expressions. In this s...
متن کاملEfficient Integration of Declarative Paradigms into Symbolic Computation Systems
This paper describes the efficient integration of the functional, logic and constraint paradigms into symbolic computation systems. Moreover, it proposes the constraint logic paradigm for the programming language of symbolic computation systems. First, it describes the integration of a separate constraint logic inference engine with the functional language of the symbolic computation system Alg...
متن کاملT OY: A Multiparadigm Declarative System
T OY is the concrete implementation of CRWL, a wide theoretical framework for declarative programming whose basis is a constructor based rewriting logic with lazy non-deterministic functions as the core notion. Other aspects of CRWL supported by T OY are: polymorphic types; HO features; equality and disequality constraints over terms and linear constraints over real numbers; goal solving by nee...
متن کاملConstraint Equations: Declarative Expression of Constraints With Automatic Enforcement
Constraint Equations provide a concise declarative language for expressing semantic constraints that require consistency among several relations. Each constraint is independently specified in application based terms and provides a natural extension to the limited semantics captured by typical schemata. Automatic constraint enforcement is accomplished by compilation of the Equations into executa...
متن کاملA toolkit for static analysis of constraint logic programs
Generic systems for the analysis of logic programs have been proposed over the last decade or so. Considerable progress has been made in terms of frameworks, algorithms, abstract domains and implementations. A number of generic top-down procedural frameworks are widely available. However, implementation e orts for bottom-up declarative frameworks are in a preliminary stage. In this thesis we de...
متن کامل